Tabu search with strategic oscillation for the maximally diverse grouping problem
نویسندگان
چکیده
Tabu Search with Strategic Oscillation for the Maximally Diverse Grouping Problem MICAEL GALLEGO Departamento de Ciencias de la Computación, Universidad Rey Juan Carlos, Spain. [email protected] MANUEL LAGUNA Leeds School of Business, University of Colorado at Boulder, USA [email protected] RAFAEL MARTÍ Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Spain [email protected] ABRAHAM DUARTE Departamento de Ciencias de la Computación, Universidad Rey Juan Carlos, Spain. [email protected] ABSTRACT
منابع مشابه
Adaptive Memory Programming for the Maximally Diverse Grouping Problem
The maximally diverse grouping problem (MDGP) is an NP-hard problem that consists of forming groups from a given set of elements in such a way that the diversity in the groups is maximized. The MDGP has applications in academics, such as creating diverse teams of students, or in design of VLSI circuits. In this paper we propose a new procedure based on the tabu search methodology to obtain high...
متن کاملTabu search and GRASP for the capacitated clustering problem
The Capacitated Clustering Problem (CCP) consists of forming a specified number of clusters or groups from a set of elements in such a way that the sum of the weights of the elements in each cluster is within some capacity limits, and the sum of the benefits between the pairs of elements in the same cluster is maximized. This problem— which has been recently tackled with a GRASP/VNS approach— a...
متن کاملStrategic oscillation for the capacitated hub location problem with modular links
The capacitated single assignment hub location problem with modular link capacities is a variant of the classical hub location problem in which the cost of using edges is not linear but stepwise, and the hubs are restricted in terms of transit capacity rather than in the incoming traffic. This problem was introduced by Yaman and Carello in [18] and treated by a branch-and-cut and a tabu search ...
متن کاملThe P-Center Problem under Uncertainty
Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...
متن کاملAPPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT
The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JORS
دوره 64 شماره
صفحات -
تاریخ انتشار 2013